%!TEX root = thesis.tex

%\documentclass{scrartcl}

%\reversemarginpar % Move the margin to the left of the page 

\newcommand{\MarginText}[1]{\marginpar{\raggedleft\itshape\small#1}} % New command defining the margin text style

%\usepackage[nochapters]{classicthesis} % Use the classicthesis style for the style of the document
%\usepackage[LabelsAligned]{currvita} % Use the currvita style for the layout of the document

%\renewcommand{\cvheadingfont}{\LARGE\color{Maroon}} % Font color of your name at the top



%\usepackage{hyperref} % Required for adding links	and customizing them
%\hypersetup{colorlinks, breaklinks, urlcolor=Maroon, linkcolor=Maroon} % Set link colors

\newlength{\datebox}\settowidth{\datebox}{Spring 2011} % Set the width of the date box in each block

\newcommand{\NewEntry}[3]{\noindent\hangindent=2em\hangafter=0 \parbox{\datebox}{\small \textit{#1}}\hspace{1.5em} #2 #3 % Define a command for each new block - change spacing and font sizes here: #1 is the left margin, #2 is the italic date field and #3 is the position/employer/location field
\vspace{0.5em}} % Add some white space after each new entry

\newcommand{\Description}[1]{\hangindent=2em\hangafter=0\noindent\raggedright\footnotesize{#1}\par\normalsize\vspace{1em}} % Define a command for descriptions of each entry - change spacing and font sizes here

%----------------------------------------------------------------------------------------

%----------------------------------------------------------------------------------------
%	NAME AND CONTACT INFORMATION SECTION
%----------------------------------------------------------------------------------------

\noindent {\large Personal Information}\vspace{0.5em} % Personal information heading

%\NewEntry{}{\textit{Born in Canada,}}{20 November 1987} % Birthplace and date

\NewEntry{email}{\href{mailto:bfuller@cs.bu.edu}{bfuller@cs.bu.edu}} % Email address

\NewEntry{website}{\href{http://cs-people.bu.edu/bfuller}{http:/cs-people.bu.edu/bfuller}} % Personal website

\NewEntry{phone}{(M) +1 (802) 999 0763}\ \ %$\cdotp$\ \ (M) +1 (000) 111 1112} % Phone number(s)

\NewEntry{address}{\\MIT Lincoln Laboratory\\244 Wood Street\\Lexington, MA, 02421}

\vspace{1em} % Extra white space between the personal information section and goal

%\noindent{Goal}\vspace{1em} % Goal heading, could be used for a quotation or short profile instead

%\Description{Perform research at the intersection of information-theory and cryptography with a focus on error-correcting codes.}\vspace{2em} % Goal text

%----------------------------------------------------------------------------------------
%	WORK EXPERIENCE
%----------------------------------------------------------------------------------------

\noindent {\large Work Experience}\vspace{1em}

\NewEntry{2007-}{Research Scientist, \textsc{MIT Lincoln Laboratory}}

\Description{Performed research at the intersection of cryptography and secure systems.
\begin{itemize}
\item \textbf{Secure and Resilient Cloud}.  Important computations increasingly occur in a cloud environment.  It is imprudent to assume that all cloud resources operate honestly.  We evaluated the applicability of multi-party computation to the cloud environment.  In particular, we considered how to build multi-party computation techniques that allow a sparse communication network.
\item \textbf{Secure Cloud Authentication}.  User's data is increasingly pushed to resources they do not control.  Strong authentication is even more important in the cloud environment.  The human iris is a potential authentication source.  We researched image processing techniques and key derivation techniques to improve iris authentication.
\item \textbf{Physical Unclonable Functions}.  A strong root-of-trust is critical to securing hardware devices.  Physical unclonable functions are one source for a root-of-trust.  We developed a optical physical unclonable function and accompanying algorithms.
\item \textbf{Dynamic Group Key Management}.  Key management is a challenge in real-world cryptographic applications.  Standard approaches use static keys and assume a fixed set of participants.  We developed and deployed a dynamic key management system.  

\end{itemize}
}  
%------------------------------------------------

\NewEntry{2006}{Intern, \textsc{National Security Agency}}

\Description{Applied mathematical principles to real-life cryptographic problems and protocols.}%Rated "truly distinctive" for Analytical Skills and Teamwork. \\ Reference: Bill \textsc{Lumbergh}\ \ +1 (000) 111 1111\ \ $\cdotp$\ \ \href{mailto:bill@initech.com}{bill@initech.com}}

%------------------------------------------------

\NewEntry{2005}{Intern, \textsc{International Business Machines}}

\Description{Collected worldwide inventory aging information, and automated process to make business recommendations about assets and reserves.  }
%Worked in the Nerd Herd and helped to solve computer problems by asking customers to turn their computers off and on again. \\ Reference: Big \textsc{Mike}\ \ +1 (000) 111 1111\ \ $\cdotp$\ \ \href{mailto:mike@buymore.com}{mike@buymore.com}}

%------------------------------------------------

\vspace{1em} % Extra space between major sections

%----------------------------------------------------------------------------------------
%	EDUCATION
%----------------------------------------------------------------------------------------

{\large Education}\vspace{1em}

\NewEntry{2011-}{Boston University}

\Description{\textbf{Doctor of Philosophy:} GPA: 3.96\ \ $\cdotp$\ \ Department: Computer Science \newline 
Advisor: Assoc. Prof.~Leonid \textsc{Reyzin}
\newline
Dissertation: Strong Key Derivation from Noisy Sources
\newline
Readers: Assoc. Prof. Leonid \textsc{Reyzin} \& Prof. Ran \textsc{Canetti} \& Assist. Prof. Daniel \textsc{Wichs}
\newline
Description:  A shared cryptographic key enables strong authentication.  Candidate sources for creating such a shared key include biometrics and physically unclonable functions.  However, these sources come with a substantial problem: noise in repeated readings.  A fuzzy extractor produces a stable key from a noisy source.  For many sources of practical importance, traditional fuzzy extractors provide no meaningful security guarantee.  This dissertation improves fuzzy extractors.  First, we show how to incorporate structural information about the physical source to facilitate key derivation.  Second, most fuzzy extractors work by first recovering the initial reading from the noisy reading.  We improve key derivation by producing a consistent key without recovering the original reading.  Third, traditional fuzzy extractors provide information-theoretic security.  We build fuzzy extractors achieving new properties by only providing security against computational bounded adversaries.
\newline
Awards: Computer Science Research Excellence Award 2014
}


\NewEntry{2009-2010}{Boston University}

\Description{\textbf{Masters of Arts:} GPA: 3.93\ \ $\cdotp$\ \ Department: Computer Science \newline 
Thesis: \textit{Computational Entropy and Information Leakage}
\newline
Readers: Assoc. Prof.~Leonid \textsc{Reyzin} \& Prof.~Peter \textsc{Gacs}
\newline
Description: We investigate how information leakage reduces computational entropy of a random variable.
We prove an intuitively natural result: conditioning on an event of probability p reduces the quality of computational  entropy by a factor of p and the quantity of metric entropy by log 1/p.  Our result improves previous bounds of Dziembowski and Pietrzak (FOCS 2008), where the loss in the quantity of entropy was related to its original quality. Our result also simplifies the result of Reingold et al. (FOCS 2008).
}

%------------------------------------------------

\NewEntry{2003-2006}{Rensselaer Polytechnic Institute}

\Description{\textbf{Bachelor of Science:} GPA: 4.00\ \ $\cdotp$\ \ Departments: Mathematics and Computer Science\newline
Description: Dual degree in mathematics and computer science with a focus on pure mathematics and number theory.  \newline
Awards: Rensselaer Medal Winner\ \ $\cdotp$ \ \ Computer Science Scholars Award}

%------------------------------------------------

\vspace{1em} % Extra space between major sections

%----------------------------------------------------------------------------------------
%	Teaching
%----------------------------------------------------------------------------------------

%----------------------------------------------------------------------------------------
%	PUBLICATIONS
%----------------------------------------------------------------------------------------
{\large Technical Papers}
\vspace{1em}

{Papers in Preparation}\vspace{1em}

\Description{Unifying Leakage Classes: Simulatable Leakage and Pseudoentropy.
Benjamin \textsc{Fuller} and Ariel \textsc{Hamlin}. Submitted November 2014.}

\Description{%\MarginText{2014} 
When are Fuzzy Extractors Possible?
Benjamin \textsc{Fuller}, Leonid \textsc{Reyzin}, and Adam \textsc{Smith}. Submitted October 2014.}

\Description{%\MarginText{2014} 
Key Derivation from Noisy Sources with More Errors than Entropy.
Ran \textsc{Canetti}, Benjamin \textsc{Fuller}, Omer \textsc{Paneth}, Leonid \textsc{Reyzin}, and Adam \textsc{Smith}. Submitted September 2014.}


{Cryptography Publications}\vspace{1em}

%\NewEntry{2013}{}

\Description{Computational Fuzzy Extractors.
\emph{Advances in Cryptology -- Asiacrypt}. Benjamin \textsc{Fuller}, Leonid \textsc{Reyzin}, and Xianrui \textsc{Meng}. December 2013.}

%------------------------------------------------

%\NewEntry{2013}}%{A Unified Approach to Deterministic Encryption -- New Constructions and a Connection to Computational Entropy}

\Description{%\MarginText{2013}
A Unified Approach to Deterministic Encryption -- New Constructions and a Connection to Computational Entropy.
\emph{Journal of Cryptology.} Benjamin \textsc{Fuller}, Adam \textsc{O'Neil}, and Leonid \textsc{Reyzin}.  December 2013.\\An earlier version of this work appeared at Theory of Cryptography 2012.  The journal version contains significant new material.}

%
%\Description{\MarginText{Theory of Cryptography}XXXX.\\ Authors: Benjamin \textsc{Fuller}, ~Adam \textsc{O'Neil}, ~Leonid \textsc{Reyzin}}

%------------------------------------------------

\vspace{1em} % Extra space between major sections

{Systems Security Publications}\vspace{1em}

%\NewEntry{Oct. 2012}{DSKE: Dynamic Set Key Encryption}
\Description{Robust Keys from Physical Unclonable Functions. \emph{IEEE Symposium on Hardware Oriented Security and Trust 2014}. Merrielle \textsc{Spain}, Benjamin \textsc{Fuller}, Kyle \textsc{Ingols}, and Robert \textsc{Cunningham}}

\Description{DSKE: Dynamic Set Key Encryption. \emph{LCN Workshop on Security in Communication Networks 2012}. Galen \textsc{Pickard}, Roger \textsc{Khazan}, Benjamin \textsc{Fuller}, and Joseph \textsc{Cooley}}

%\NewEntry{June. 2010}{ASE: Authenticated Statement Exchange}

\Description{ASE: Authenticated Statement Exchange. \emph{IEEE Network Computing and Applications 2010}. Benjamin \textsc{Fuller}, Roger \textsc{Khazan}, Joseph \textsc{Cooley}, and Galen \textsc{Pickard}. \textbf{Best Paper Award.}}

\Description{GROK: A Practical System for Securing Group Communications. \emph{IEEE Network Computing and Applications 2010}. Joseph \textsc{Cooley}, Roger \textsc{Khazan}, Benjamin \textsc{Fuller}, and Galen \textsc{Pickard}. \textbf{Best Paper Nominee.}}

\Description{GROK Secure Multi-User Chat at Red Flag 2007-03. \emph{Military Communications Conference 2008}. Roger \textsc{Khazan}, Joseph \textsc{Cooley}, Galen \textsc{Pickard}, and Benjamin \textsc{Fuller}.}

\Description{Integrated Environment Management for Informaiton Operations Testbeds.. \emph{Workshop on Visualization for Computer Security 2007}. Tamara \textsc{Yu}, Benjamin \textsc{Fuller}, John \textsc{Bannick}, Lee \textsc{Rossey}, and Robert \textsc{Cunningham}.}

\vspace{1em}

{Unpublished Works}\vspace{1em}

%\NewEntry{Oct. 2012}{DSKE: Dynamic Set Key Encryption}
\Description{Computational Entropy and Information Leakage, 2011. Benjamin \textsc{Fuller} and Leonid \textsc{Reyzin}}

\vspace{1em}

\pagebreak

{ Teaching}\vspace{1em}

\Description{Teaching Assistant for Introduction to Network Security 2013.  \\Professor: Ran \textsc{Canetti}.}

\Description{Teaching Assistant for Introduction to Cryptography 2012. \\Professor: Leonid \textsc{Reyzin}.}

\Description{Teaching Assistant for Computer Architecture 2006.  \\Professor: Franklin \textsc{Luk}.}

\Description{Basic Skills Assistant for Calculus 2006.  \\Professor: Bruce \textsc{Piper}.}

\Description{Teaching Assistant for Computer Organization 2006.\\  Professor: Franklin \textsc{Luk}.}
